系统效能综合建模方法研究

在介绍了几种常见的武器系统效能建模方法之后,提出了一种综合采用解析计算、仿真、层次分析、模糊评判、专家评估等手段来建立效能模型的方法     

武装直升机综合火/飞系统的组合智能控制

讨论了武装直升机综合火／飞系统的组合智能控制及系统的设计方法,并且针对某型直升机用数字仿真证明了这种系统的优点及其良好效能     

雷达至指挥仪基线修正研究

综合诸元是指挥仪解算精度较高的一种工作方式,但存在一个雷达至指挥仪间的基线误差,就这一误差进行了分析并提出了修正方法。     

武器装备的综合性能

武器装备除了具备传统的作战性能外,还应具备适用于作战的保障性能.作战性能和保障性能统称武器综合性能.综合性能要依靠传统工程技术及专业工程技术的综合,用系统工程的方法去解决.     

P波段中功率混合集成放大器设计与制作

文中介绍了P 波段6瓦功率放大器的研制过程,讨论了有关理论和实际问题。该放大器采用微带和集中参数混合电路形式,具有体积小,结构紧凑,调试方便,性能稳定的特点。该电路已成功地用于某雷达整机。     

综合航空火力控制系统及其模拟仿真

论述了综合航空火力控制系统在现代空战中的地位,并对系统及各子系统所完成的任务和他们之间的相互关系作了较为详细的介绍。对系统的模拟仿真原理及其仿真过程作了简要的阐述。此外,对模拟仿真中所需的实验设备也作了简要的介绍。     

Alpha 工作站仿真一体化环境交互系统设计

交互系统是一体化建模仿真环境中的一个重要环节,主要解决人机关系,使用户可以方便地与仿真机作高速通讯,对仿真运行进行实时监控。本文在简要介绍整个系统概况的基础上,对交互系统的总体设计、命令分析与处理、功能实现等几个方面展开了讨论。此外,还简单介绍了交互界面的设计和实现情况     

高炮火控系统模拟训练及综合评价系统

提出了一种新型的基于计算机及计算技术的高炮火控系统仿真模拟训练及综合评价系统的设计方案。这一方案不仅注重了系统实现仿真训练的基本功能,同时还利用计算机仿真优势,强调了对训练效果的评估及对训练模式的总结。提出了实时决策支持的新概念     

Puzzle‐based storage systems

We introduce and develop models for a physical goods storage system based on the 15‐puzzle, a classic children's game in which 15 numbered tiles slide within a 4 × 4 grid. The objective of the game is to arrange the tiles in numerical sequence, starting from a random arrangement. For our purposes, the tiles represent totes, pallets, or even containers that must be stored very densely, and the objective is to maneuver items to an input–output point for retrieval or processing. We develop analytical results for storage configurations having a single empty location (as in the game) and experimental results for configurations with multiple empty locations. Designs with many empty locations can be made to form aisles, allowing us to compare puzzle‐based designs with traditional aisle‐based designs found in warehousing systems. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

The minmax multidimensional knapsack problem with application to a chance‐constrained problem

In this paper we present a new combinatorial problem, called minmax multidimensional knapsack problem (MKP), motivated by a military logistics problem. The logistics problem is a two‐period, two‐level, chance‐constrained problem with recourse. We show that the MKP is NP‐hard and develop a practically efficient combinatorial algorithm for solving it. We also show that under some reasonable assumptions regarding the operational setting of the logistics problem, the chance‐constrained optimization problem is decomposable into a series of MKPs that are solved separately. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007